Convergence of Invariant Measures of Truncation Approximations to Markov Processes
نویسندگان
چکیده
Let Q be the Q-matrixof an irreducible, positive recurrent Markov process on a countable state space. We show that, under a number of conditions, the stationary distributions of the n × n north-west corner augmentations of Q converge in total variation to the stationary distribution of the process. Twoconditions guaranteeing such convergence include exponential ergodicity and stochastic monotonicity of the process. The same also holds for processes dominated by a stochastically monotone Markov process. In addition, we shall show that finite perturbations of stochastically monotone processes may be viewed as being dominated by a stochastically monotone process, thus extending the scope of these results to a larger class of processes. Consequently, the augmentation method provides an attractive, intuitive method for approximating the stationary distributions of a large class of Markov processes on countably infinite state spaces from a finite amount of known information.
منابع مشابه
Continuity of Generalized Semi-Markov Processes
It is shown that sequences of generalized semi-Markov processes converge in the sense of weak convergence of random functions if associated sequences of defining elements (initial distributions, transition functions and clock time distributions) converge. This continuity or stability is used to obtain information about invariant probability measures. It is shown that there exists an invariant p...
متن کاملStability and approximation of invariant measures of Markov chains in random environments
We consider finite-state Markov chains driven by stationary ergodic invertible processes representing random environments. Our main result is that the invariant measures of Markov chains in random environments (MCREs) are stable under a wide variety of perturbations. We prove stability in the sense of convergence in probability of the invariant measure of the perturbed MCRE to the original inva...
متن کاملThe exit time finite state projection scheme: bounding exit distributions and occupation measures of continuous-time Markov chains
We introduce the exit time finite state projection (ETFSP) scheme, a truncation-based method that yields approximations to the exit distribution and occupation measure associated with the time of exit from a domain (i.e., the time of first passage to the complement of the domain) of a continuous-time Markov chain. We prove that: (i) the computed approximations bound the desired measures from be...
متن کاملADK Entropy and ADK Entropy Rate in Irreducible- Aperiodic Markov Chain and Gaussian Processes
In this paper, the two parameter ADK entropy, as a generalized of Re'nyi entropy, is considered and some properties of it, are investigated. We will see that the ADK entropy for continuous random variables is invariant under a location and is not invariant under a scale transformation of the random variable. Furthermore, the joint ADK entropy, conditional ADK entropy, and chain rule of this ent...
متن کاملInvariant Densities and Escape Rates: Rigorous and Computable Approximations in the L∞-norm
In this article we study a piecewise linear discretization schemes for transfer operators (Perron-Frobenius operators) associated with interval maps. We show how these can be used to provide rigorous pointwise approximations for invariant densities of Markov interval maps. We also derive the order of convergence of the approximate invariant density to the real one in the L∞-norm. The outcome of...
متن کامل